A Novel Event-centric Trend Detection Algorithm for Online Social Graph Analysis
نویسندگان
چکیده
منابع مشابه
Structural Trend Analysis for Online Social Networks
The notion of trends in social networks has emerged as an important problem attracting the attention of researchers as well as the industry. Although, recent work has studied trends from various perspectives such as its temporal and geospatial properties, the structural properties of the network that creates such trends are ignored in trend detection. In this work, we propose two novel structur...
متن کاملA Secure Online Algorithm for Link Analysis on Weighted Graph
Link analysis algorithms have been used successfully on hyperlinked data to identify authoritative documents and retrieve other information. However, existing link analysis algorithms such as HITS suffer two major limitations: (1) they only work in environments with explicit hyperlinked structure such as www or social network and (2) they fail to capture the rich information that is encoded by ...
متن کاملSocial network data analysis for event detection
Cities concentrate enough Social Network (SN) activity to empower rich models. We present an approach to event discovery based on the information provided by three SN, minimizing the data properties used to maximize the total amount of usable data. We build a model of the normal city behavior which we use to detect abnormal situations (events). After collecting half a year of data we show examp...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملℓ1-Graph Based Community Detection in Online Social Networks
Detecting community structures in online social network is a challenging job for traditional algorithms, such as spectral clustering algorithms, due to the unprecedented large scale of the network. In this paper, we present an efficient algorithm for community detection in online social network, which chooses relatively small sample matrix to alleviate the computational cost. We use -graph to c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Theory and Application
سال: 2017
ISSN: 2005-4270,2005-4270
DOI: 10.14257/ijdta.2017.10.2.04